Hierarchical heuristics for Boolean-reasoning-based binary bicluster induction

Abstract Biclustering is a two-dimensional data analysis technique that, applied to matrix, searches for subset of rows and columns that intersect produce submatrix with given, expected features. Such an approach requires different methods those typical classification or regression tasks. In recent years it has become possible express biclustering goals in the form Boolean reasoning. This paper presents new, heuristic bicluster induction binary data.